Hosoya polynomials of random benzenoid chains
نویسندگان
چکیده مقاله:
Let $G$ be a molecular graph with vertex set $V(G)$, $d_G(u, v)$ the topological distance between vertices $u$ and $v$ in $G$. The Hosoya polynomial $H(G, x)$ of $G$ is a polynomial $sumlimits_{{u, v}subseteq V(G)}x^{d_G(u, v)}$ in variable $x$. In this paper, we obtain an explicit analytical expression for the expected value of the Hosoya polynomial of a random benzenoid chain with $n$ hexagons. Furthermore, as corollaries, the expected values of the well-known topological indices: Wiener index, hyper-Wiener index and Tratch-Stankevitch-Zefirov index of a random benzenoid chain with $n$ hexagons can be obtained by simple mathematical calculations, which generates the results given by I. Gutman et al. [Wiener numbers of random benzenoid chains, Chem. Phys. Lett. 173 (1990) 403-408].
منابع مشابه
hosoya polynomials of random benzenoid chains
let $g$ be a molecular graph with vertex set $v(g)$, $d_g(u, v)$ the topological distance between vertices $u$ and $v$ in $g$. the hosoya polynomial $h(g, x)$ of $g$ is a polynomial $sumlimits_{{u, v}subseteq v(g)}x^{d_g(u, v)}$ in variable $x$. in this paper, we obtain an explicit analytical expression for the expected value of the hosoya polynomial of a random benzenoid chain with $n$ hexagon...
متن کاملOn the tutte polynomial of benzenoid chains
The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte polynomial of a benzenoid chain is presented.
متن کاملHosoya polynomials under gated amalgamations
An induced subgraph H of a graph G is gated if for every vertex x outside H there exists a vertex x ′ inside H such that each vertex y of H is connected with x by a shortest path passing through x . The gated amalgam of graphs G1 and G2 is obtained from G1 and G2 by identifying their isomorphic gated subgraphs H1 and H2. Two theorems on Hosoya polynomials of gated amalgams are provided. As thei...
متن کاملOn Classifications of Random Polynomials
Let $ a_0 (omega), a_1 (omega), a_2 (omega), dots, a_n (omega)$ be a sequence of independent random variables defined on a fixed probability space $(Omega, Pr, A)$. There are many known results for the expected number of real zeros of a polynomial $ a_0 (omega) psi_0(x)+ a_1 (omega)psi_1 (x)+, a_2 (omega)psi_2 (x)+...
متن کاملThe Hosoya polynomial decomposition for hexagonal chains
For a graph G we denote by dG(u, v) the distance between vertices u and v in G, by dG(u) the degree of vertex u. The Hosoya polynomial of G is H(G) = ∑ {u,v}⊆V (G) x dG (u,v). For any positive numbers m and n, the partial Hosoya polynomials of G are Hm(G) = ∑ {u, v} ⊆ V (G) dG (u) = dG (v) = m xdG (u,v), Hmn(G) = ∑ {u, v} ⊆ V (G) dG (u) = m, dG (v) = n xdG (u,v). It has been shown that H(G1) − ...
متن کاملComputing Hosoya Polynomials of Graphs from Primary Subgraphs
The Hosoya polynomial of a graph encompasses many of its metric properties, for instance the Wiener index (alias average distance) and the hyperWiener index. An expression is obtained that reduces the computation of the Hosoya polynomials of a graph with cut vertices to the Hosoya polynomial of the so-called primary subgraphs. The main theorem is applied to specific constructions including bouq...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 7 شماره 1
صفحات 29- 38
تاریخ انتشار 2016-03-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023